Finding Longest Common Increasing Subsequence for Two Different Scenarios of Non-random Input Sequences
نویسندگان
چکیده
By reviewing Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS), the Longest Common Increasing Subsequence (LCIS) problem is explored for two non-random input cases in details. Specifically, we designed two algorithms, one solving the input sequence scenario with the case that one sequence is ordered and duplicate elements are allowed in each of sequences, and the second solving the input sequence scenario with the case that two unordered sequences have all distinct elements in each of them.
منابع مشابه
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest Common Increasing Subsequence for two random input sequences is reported. It runs in O(m n log p) time complexity and takes space of O(2(m + n + 1) p), where m and n are the length for two input sequences respectively,...
متن کاملFaster Algorithms for Computing Longest Common Increasing Subsequences
We present algorithms for finding a longest common increasing subsequence of two or more input sequences. For two sequences of lengths n and m, where m ≥ n, we present an algorithm with an output-dependent expected running time of O((m + nl) log log σ + Sort) and O(m) space, where l is the length of an LCIS, σ is the size of the alphabet, and Sort is the time to sort each input sequence. For k ...
متن کاملA simple linear space algorithm for computing a longest common increasing subsequence
This paper reformulates the problem of finding a longest common increasing subsequence of the two given input sequences in a very succinct way. An extremely simple linear space algorithm based on the new formula can find a longest common increasing subsequence of sizes n and m respectively, in time O(nm) using additional min{n,m}+ 1 space.
متن کاملFast Algorithms for Finding the Common Subsequence of Multiple Sequences
* This research work was partially supported by the National Science Council of the Republic of China under contract NSC-90-2213-E-110-015. AbstractThe longest common subsequence (LCS) algorithm is a useful method for measuring the identities and for finding similar subsequences in several sequences. Unfortunately, the longest common subsequence problem is NP-hard. In the past years, some algor...
متن کاملApproximability of Constrained LCS
Given two input sequences A 1 and A 2 and one constraint sequence B, C-LCS is the problem of finding a longest common subsequence C of A 1 and A 2 that is also a supersequence of B: A 1 = cgagggt A 2 = cgggagt B = cat C = cgagt Constrained Longest Commmon Subsequence is a natural extension to the classical problem Longest Common Subsequence, and has application to computing the homology of two ...
متن کامل